An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT

Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT

MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.8279. This improves a previously conjectured performance guarantee of 0.7977 of Zwick [Zwi99]. Using a variant of our MAX NAE-SAT approximation algorithm, combined with other techniques used in [Asa03], we obtain an app...

Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans

We present a complete analysis of the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans using various analytical and computational tools. By ne-tuning the rotation functions used we obtain minutely improved performance ratios for these problems. The rotation functions used for getting these improvements are essentially optimal as the performance ratios obtained using them a...

Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP

We give improved deterministic algorithms solving sparse instances of MAX-SAT and MAX-k-CSP. For instances with n variables and cn clauses (constraints), we give algorithms running in time poly(n)· 2n(1−μ) for – μ = Ω( 1 c ) and polynomial space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 √ c ) and exponential space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 ck2 ) and polynomial space solving MAX-k-...

Improved approximations for max set splitting and max NAE SAT

Improved Exact Algorithms for MAX-SAT

In this paper we present improved exact and parameterized algorithms for the maximum satisfiability problem. In particular, we give an algorithm that computes a truth assignment for a boolean formula F satisfying the maximum number of clauses in time O(1.3247|F |), where m is the number of clauses in F , and |F | is the sum of the number of literals appearing in each clause in F . Moreover, giv...